A Modified Path of Steepest Ascent for Split-Plot Experiments
نویسندگان
چکیده
I NDUSTRIAL experiments often involve two types of factors: those that are hard to change and those that are easy to change. The experiments are performed by fixing the levels of the hard-to-change factors and then running all or some of the combinations of the easy-to-change factor levels. Then, a new setting in the hard-to-change factors is selected and the process is repeated. With replication, this type of randomization leads to two error terms and is known as a split-plot experiment. The hard-to-change factors are called the whole-plot factors and the easyto-change factors are called the subplot factors.
منابع مشابه
Constant time Steepest Ascent Local Search with Statistical Lookahead for NK-Landscapes
A modified form of steepest ascent local search is proposed that displays an average complexity of O(1) time per move for NKLandscape problems. The algorithm uses a Walsh decomposition to identify improving moves. In addition, it is possible to compute a Hamming distance 2 statistical lookahead: if x is the current solution and y is a neighbor of x, it is possible to compute the average evaluat...
متن کاملModification of the saffron model for growth and yield prediction under different irrigation water salinity, manure application and planting methods
The Saffron Yield Estimation Model (SYEM) was modified for salinity conditions, cowmanure application and planting methods using two-year experiments data in Badjgah region ofIran. A split-split plot arrangement was conducted in complete randomized block design duringtwo years with irrigation water salinity levels (0.45 (fresh water, S1), 1.0 (S2), 2.0 (S3) and 3.0(S4) dS m-1) as the main plot,...
متن کاملResidual norm steepest descent based iterative algorithms for Sylvester tensor equations
Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...
متن کاملBiobleaching of Bagasse Pulp with Xylanase Enzymes and Hydrogen Peroxide
The effect of the operating conditions (temperature, time, pH, enzyme level and pulp consistency) used in the enzymatic step of a XP (Cartazyme-hydrogen peroxide) sequence for bleaching Kraft pulp from bagasse on various properties of the resulting pulp and paper sheet products was studied. The quality of bagasse used, was examined by its yield, brightness,viscosity and the Kappa number. Finall...
متن کاملSteepest Ascent Tariff Reforms
This paper introduces the concept of a steepest ascent tariff reform for a small open economy. By construction, it is locally optimal in that it yields the highest gain in utility of any feasible tariff reform vector of the same length. Accordingly, it provides a convenient benchmark for the evaluation of the welfare effectiveness of other tariff reform proposals. We develop the properties of t...
متن کامل